Solving large Steiner Triple Covering Problems
نویسندگان
چکیده
منابع مشابه
Solving large Steiner Triple Covering Problems
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming techniques. One major source of difficulty for instances of this family is their highly symmetric structure, which impairs the performance of most branch-and-bound algorithms. The largest instance in the family that ha...
متن کاملSolving group Steiner problems as Steiner problems
The generalized spanning tree or group Steiner problem (GSP) is a generalization of the Steiner problem in graphs (SPG): one requires a tree spanning (at least) one vertex of each subset, given in a family of vertex subsets, while minimizing the sum of the corresponding edge costs. Specialized solution procedures have been developed for this problem. In this paper we investigate the performance...
متن کاملSolving Rectilinear Steiner Tree Problems
The rectilinear Steiner tree problem asks for a shortest tree connecting given points in the plane with rectilinear distance. The best theoretically analyzed algorithm for this problem with a fairly practical behaviour bases on dynamic programming and has a running time of O(n 2 2:62 n) (Ganley/Cohoon). The best implementation can solve random problems of size 35 (Salowe/Warme) within a day. In...
متن کاملSolving hard set covering problems
We propose a new branch-and-bound algorithm to solve hard instances of set covering problems arising from Steiner triple systems.
متن کاملOn Solving Binate Covering Problems
Binate (or unate) covering problems occur at several steps during logic synthesis including two-level minimization and DAG covering. This paper presents a better lower bound computation algorithm and two new pruning techniques that significantly improve the efficiency of binate covering problem solvers. We show that these techniques reduce by up to three orders of magnitude the time required to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2011
ISSN: 0167-6377
DOI: 10.1016/j.orl.2011.02.001